Optimization-based smoothing algorithm for triangle meshes over arbitrarily shaped domains

نویسنده

  • Daniel Aubram
چکیده

This paper describes a node relocation algorithm based on nonlinear optimization which delivers excellent results for both unstructured and structured plane triangle meshes over convex as well as non-convex domains with high curvature. The local optimization scheme is a damped Newton’s method in which the gradient and Hessian of the objective function are evaluated exactly. The algorithm has been developed in order to continuously rezone the mesh in arbitrary Lagrangian-Eulerian (ALE) methods for large deformation penetration problems, but it is also suitable for initial mesh improvement. Numerical examples highlight the capabilities of the algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sharp Feature Preservation in Octree-Based Hexahedral Mesh Generation for CAD Assembly Models

This paper describes an automatic and robust approach to convert 3D CAD assembly models into unstructured hexahedral meshes that are conformal to the given B-Reps (boundary-representations) with sharp feature preservation. In previous works, we developed an octree-based isocontouring method to construct unstructured hexahedral meshes for manifold and non-manifold domains. However, sharp feature...

متن کامل

An unstructured quadrilateral mesh generation algorithm for aircraft structures

Because commercial aircraft are built with thin-walled structures, their structural performance is well-modeled using shell-element meshes. However, creating these meshes for the full aircraft configuration can be challenging and presents a bottleneck in the design process, especially in a configuration-level design space. This paper presents an algorithm that automatically creates unstructured...

متن کامل

Remeshing triangulated surfaces with optimal parameterizations

The use of polygonal meshes, especially triangle meshes, is manifold, but a lot of algorithms require the mesh to be structured in a certain way and cannot be applied to an arbitrarily structured mesh. The process of replacing an arbitrarily structured mesh by a structured one is called remeshing and the most important class of structered meshes are triangle meshes with subdivision connectivity...

متن کامل

Mesh improvement by minimizing a weighted sum of squared element volumes

We describe a new mesh smoothing method that consists of minimizing the sum of squared element volumes over the free vertex positions. To the extent permitted by the fixed vertices and mesh topology, the resulting mesh elements have uniformly distributed volumes. In the case of a triangulation, uniform volume implies well-shaped triangles. If a graded mesh is required, the element volumes may b...

متن کامل

Quadrilateral Remeshing

The use of polygonal meshes, especially triangle meshes, is manifold but a lot of algorithms require the mesh to be structured in a certain way and cannot be applied to an arbitrarily shaped mesh. The process of replacing an arbitrary mesh by a structured one is called remeshing. Triangle meshes with subdivision connectivity are an important class of structured meshes and have been studied thor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1410.5977  شماره 

صفحات  -

تاریخ انتشار 2014